منابع مشابه
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014) reconsidered classical fundamental graph algorithms focusing on improving the space complexity. Elmasry et al. gave, among others, an implementation of depth first search (DFS) of a graph on n vertices and m edges, taking O(m lg lgn) time1 using O(n) bits of space improving on the time bound of O(m lgn) due to Asano et al....
متن کاملAn Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph
Given a biconnected network G with n nodes and a speciic edge r; s o f G, the st-numbering problem asks for an assignment o f i n tegers to the nodes satisfying the following condition: r is assigned the number 1 and s is assigned the number n and all other nodes are assigned numbers in such a w ay that every node other than r and s has a neighbour with smaller st-number and a neighbour with la...
متن کاملValue Numbering
Value numbering is a compiler-based program analysis method that allows redundant computations to be removed. This paper compares hash-based approaches derived from the classic local algorithm1 with partitioning approaches based on the work of Alpern, Wegman, and Zadeck2. Historically, the hash-based algorithm has been applied to single basic blocks or extended basic blocks. We have improved th...
متن کاملBiconnectivity, st-numbering and other applications of DFS using O(n) bits
We consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and 2-edge connectivity, finding cut vertices and cut edges, computing chain decomposition and st-numbering of a given undirected graphG on n vertices and m edges. Classical algorithms for them typically use DFS and some Ω(lgn) bits1 of information at each vertex. Bu...
متن کاملSCC-Based Value Numbering
Value numbering is an optimization that assigns numbers to values in such a way that two values are assigned the same number if and only if the compiler can prove they are equal. When this optimization discovers two computations that produce the same value, it can (under certain circumstances) eliminate one of them. There are two competing techniques for proving equivalences: hashing and partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1976
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90086-4